Location:
Search - binary tree
Search list
Description: 叉排序树与平衡二叉排序树基本操作的实现
用二叉链表作存储结构
(1)以回车( \n )为输入结束标志,输入数列L,生成二叉排序树T；
(2)对二叉排序树T作中序遍历,输出结果；
(3)计算二叉排序树T的平均查找长度,输出结果；
(4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结
点,并作中序遍历(执行操作2)；否则输出信息“无结点x”；
(5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and balanced binary tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \ n) to mark the end of the importation, importation of L series, generate binary tree Sort T; (2) Ranking of two forks to make the tree T preorder, and the output results; (3) Calculations binary tree T ranking on the average search length, output; (4) Input elements x, find two tree fork Sort T, if x exists with the node, then remove the nodes, and make the preorder (execution 2); Otherwise output "node x"; (5) to determine the order of two trees T fork whether balanced binary tree, and the output message "OK!"/"NO!" ;
Platform: |
Size: 2048 |
Author: 胡图 |
Hits:
Description: 常用树数据结构集合，包括二叉树、二叉查找树、AA树、红黑树、伸展树的一整套实现，自带包装器、异常处理类，方便使用-common pool tree data structure, including the binary tree, binary search tree, AA tree, a red, black tree extend to achieve a set of trees, bringing their wrapper, abnormal class, user-friendly
Platform: |
Size: 13312 |
Author: esonic |
Hits:
Description: 平衡二叉树操作的演示
一、 需求分析
（1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。
（2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。
（3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。
-balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Insert the available balance transform inverse transform.
Platform: |
Size: 40960 |
Author: 苏言暖 |
Hits:
Description: 用 java实现的 搜索二叉树的插入、删除、遍历和平衡，是自己用与数据结构考试编写的 ，对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming
Platform: |
Size: 2048 |
Author: 记忆超 |
Hits:
Description: 数据结构的平衡二叉树的操作，包括插入和删除，查找-Balanced binary tree data structure of the operation, including insert and delete, search
Platform: |
Size: 8192 |
Author: lj |
Hits:
Description: 利用MFC库
实现数据结构二叉树的一个简单例子，除算法外，包含一些基本的算法结果显示，有助于了解掌握二叉树-The use of MFC library binary tree data structure to achieve a simple example, with the exception of algorithms, the algorithm contains some basic results showed that help understand binary tree
Platform: |
Size: 35840 |
Author: GYK |
Hits:
Description: pda上实现二叉树生成演示，以app形式打包了-pda realize the binary tree generated presentation to a packed app form
Platform: |
Size: 64512 |
Author: tony_yang |
Hits:
Description: 二叉树的建立,遍历(两种方法),以及用txt文件存储二叉树的方式,还包括队列 堆栈的操作-Tree establishment, ergodicity (two methods), as well as txt file storage by way of binary tree, but also the operation of queue stack
Platform: |
Size: 6144 |
Author: 王家 |
Hits:
Description: 二进制树防碰撞算法,使用二叉树算法避免RFID相互干扰-Binary tree anti-collision algorithm, binary tree algorithm to avoid the use of RFID interference
Platform: |
Size: 264192 |
Author: 郭娟 |
Hits:
Description: TC 下用图形显示二叉树的建立与遍历过程-TC using graphical display binary tree traversal process of the establishment and
Platform: |
Size: 2048 |
Author: 云忠言 |
Hits:
Description: 演示二叉树的生成及一些常用操作；
包括插入节点，删除节点等。-Demonstration of the generation of binary tree and a number of commonly used operations include insert node, delete node and so on.
Platform: |
Size: 3072 |
Author: Alex |
Hits:
Description: 利用数据结构的二叉树概念编写的MATLAB程序实现HUFFMAN编码。-Binary tree data structure using the concept of the preparation of the MATLAB program Huffman coding.
Platform: |
Size: 1024 |
Author: 沈少云 |
Hits:
Description: （1）输入字符序列，建立二叉链表。
（2）中序遍历二叉树:递归算法。
（3）中序遍历二叉树:非递归算法（最好也能实现先序，后序非递归算法）。
（4）求二叉树的高度 。
（5）求二叉树的叶子个数。
（6）建立中序线索二叉树，并实现中序遍历。
（8）借助队列实现二叉树的层次遍历。
（9）在主函数中设计一个简单的菜单，分别调试上述算法。
-(1) input sequence of characters, the establishment of binary list. (2) traversal of binary tree: recursive algorithm. (3) in order binary tree traversal: Non-recursive algorithm (the best can achieve the first order, after the sequence of non-recursive algorithm). (4) for tree height. (5) for the number of tree leaves. (6) in order to establish clues to binary tree and traversal implementation. (8) through the queue to achieve the level of binary tree traversal. (9) in the main function in the design of a simple menu, respectively, the above algorithm debugging.
Platform: |
Size: 322560 |
Author: jack |
Hits:
Description: 用二叉树实现重言式真假的判别问题,对于矛盾式可以进行自己输入值判断-With binary tree to achieve true tautology Discriminant problems contradiction can enter their own value judgments
Platform: |
Size: 2048 |
Author: 李天宇 |
Hits:
Description: 数据结构
1、算法思路：
哈夫曼树算法：a）根据给定的n个权值{W1，W2… ，Wn }构成 n棵二叉树的集合F={T1，T2…，T n }，其中每棵二叉树T中只有一个带权为W i的根结点，其左右子树均空；b）在F中选取两棵根结点的权值最小的树作为左右子树构造一棵新的二叉树，且置新的二叉树的根结点的权值为其左、右子树上结点的权值之和；c）F中删除这两棵树，同时将新得到的二叉树加入F中； d）重复b)和c),直到F只含一棵树为止。
-Data Structure 1, Algorithm idea: Huffman tree algorithm: a) in accordance with a given value of n of the right (W1, W2 ..., Wn) constitute a set of n binary tree trees F = (T1, T2 ..., T n) , which for each binary tree T with only one right for the W i of the root node, its about subtree are empty b) in the F 2 in the root node of the right to select the smallest value of the tree as a subtree structure around a new binary tree, binary tree and the new home of the root node of the right value for the left and right sub-tree nodes and the right value c) F in the deletion of the two trees, at the same time obtained by adding a new binary tree F in d) repeat b) and c), until a tree F containing only so far.
Platform: |
Size: 28672 |
Author: Anson |
Hits:
Description: 使用二叉树的常见功能，在图形界面上画出二叉树的结构-The common use of binary tree functions in a graphical interface on the structure of painted tree
Platform: |
Size: 571392 |
Author: 陈国富 |
Hits:
Description: 程序包括了平衡二叉树的查找,插入,删除,合并等操作-Procedures, including the balanced binary tree search, insert, delete, merge, such as operation
Platform: |
Size: 3072 |
Author: 李 |
Hits:
Description: 完成二叉树的初始化、遍历以及相应的操作-Complete binary tree initialization, ergodicity and the corresponding operation
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 表达式类型的实现:
1、 一个表达式和一颗二叉树之间，存在着自然的对应关系。
2、 假设算术表达式Expression内可以含有变量（a～z）、常量（0～9）和二元运算符（＋，－，*，/，^）。实现一下操作。
（1） ReadExpr(E)——以字符序列的形式输入语法正确的前缀表示式并构造表达式E。
（2） WritrExpr(E)——用带括弧的中缀表示式输出表达式E。
（3） Assign(V,c)——实现对变量V的赋值(V=c),变量的初值为0。
（4） Value(E)——对算术表达式E求值。
（5） CompoundExpr(P,E1,E2)——构造一个新的复合表达式（E1）P (E2)。
-Realize the type of expression: one, an expression, and between a binary tree, there is a natural correspondence between. 2, assuming that the arithmetic expression Expression can contain variables (a ~ z), constant (0 ~ 9) and binary operators ( ,-,*,/,^)。 You realize the operation. (1) ReadExpr (E)- sequence of characters in the form of input grammar correct prefix expressions and tectonic expression of E. (2) WritrExpr (E)- used within parentheses express output infix expression E. (3) Assign (V, c)- realize the value V of the variables (V = c), variable initial value is 0. (4) Value (E)- on the arithmetic expression E is evaluated. (5) CompoundExpr (P, E1, E2)- Construction of a new composite expression (E1) P (E2).
Platform: |
Size: 58368 |
Author: |
Hits:
Description: 平衡二叉树操作的演示:
1、 操作界面给出查找、插入、删除、退出等操作选择。
2、 每种操作均要提示输入关键字。
3、 每次插入或删除一个节点后，应更新平衡二叉树的显示（以凹入表形式显示）。
-Balanced binary tree operations Demo: 1, Operator Interface given to find, insert, delete, withdraw from the operation of choice and so on. 2, each operation must be prompted to enter a keyword. 3, each insert or delete a node, it should update the display of a balanced binary tree (in the form of indentation shown).
Platform: |
Size: 245760 |
Author: |
Hits:
«
1
23
4
5
6
7
8
9
10
...
50
»